Sparse Hypercube—a minimal k-line broadcast graph
نویسندگان
چکیده
منابع مشابه
Sparse Hypercube: A Minimal k-Line Broadcast Graph
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k during any time unit. In the proposed method, we eliminate edges from binary ncubes. We show that, by this approach, the maximum degree of a vertex can be reduced from n to at most (2k 1) k pn k , where 2 k < n, which asymp...
متن کاملSparseAssembler2: Sparse k-mer Graph for Memory Efficient Genome Assembly
Motivation: To tackle the problem of huge memory usage associated with de Bruijn graph-based algorithms, upon which some of the most widely used de novo genome assemblers have been built, we released SparseAssembler1. SparseAssembler1 can save as much as 90% memory consumption in comparison with the state-of-art assemblers, but it requires rounds of denoising to accurately assemble genomes. Alg...
متن کاملk-Kernels in Orientations of the Line Graph
Let G be a graph, L(G) its line graph and D an orientation of L(G) such that Asym(D) is strongly connected and each directed triangle has two symmetrical arcs. In this paper we prove: If every directed cycle of D, −→C = (0, 1, . . . , n−1, 0) with (−→C ) ≡ 0 (modk) has a chord (i, j) such that at least one of the two following properties holds: (1) j ∈ {i− 2, i + 2} or (2) if j ∈ {i− 2, i + 2},...
متن کاملCdmtcs Research Report Series Compound Constructions of Minimal Broadcast Networks Compound Constructions of Minimal Broadcast Networks
Compound methods have been shown to be very eeective in the construction of minimal broadcast networks (mbns). Compound methods generate a large mbn by combining multiple copies of an mbn G using the structure of another mbn H. Node deletion is also allowed in some of these methods. The subset of connecting nodes of G has been deened as solid h-cover by Bermond, Fraigniaud and Peters, and cente...
متن کاملLine graphs associated to the maximal graph
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00244-5